The maximum clique problem
نویسندگان
چکیده
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
منابع مشابه
The Maximum Clique Problem Handbook Of Combinatorial Optimization
The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...
متن کاملFinding the maximum clique in massive graphs
1. ABSTRACT Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NPhard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in...
متن کاملA Spinorial Formulation of the Maximum Clique Problem of a Graph
We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B where B is a complex, symmetric matrix formed by vectors of zero length (null vectors) and the maximum clique problem can be transformed in a geometrical problem for these vectors. This problem, in turn, is tran...
متن کاملComplexity Analysis of Clique Problem
MAXIMUM CLIQUE PROBLEM the most relevant problem in Graph theory, known for years still do not have its polynomial time solution. Many algorithms have been proposed, still the problem lie the same i.e. to find the Clique in the polynomial time. The Clique problem is to figure out the sub graph with the maximum cardinality. Maximum clique in a random graph is NP-Hard problem, actuated by many pr...
متن کاملModified Approach for Solving Maximum Clique Problem
1.1 Maximum Clique Problem Assume that the finite undirected simple graph is given, where V is the set of nodes, E is the set of edges. The arbitrary full graph is called a clique. The clique, which does not contain other cliques, is called a maximal Clique. The largest maximal clique is called a maximum clique. To extract all maximal cliques from the graph G. Many algorithms have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Global Optimization
دوره 4 شماره
صفحات -
تاریخ انتشار 1994